On Approximating the Depth and Related Problems
نویسندگان
چکیده
منابع مشابه
On Approximating Asymmetric TSP and Related Problems
In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, these choices need to be specified. We show a worst case performance with some deterministic assump...
متن کاملApproximating the Simplicial Depth
Let P be a set of n points in d-dimensions. The simplicial depth, σP (q) of a point q is the number of d-simplices with vertices in P that contain q in their convex hulls. The simplicial depth is a notion of data depth with many applications in robust statistics and computational geometry. Computing the simplicial depth of a point is known to be a challenging problem. The trivial solution requi...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولComputing Depth Orders and Related Problems
Let K be a set of n non-intersecting objects in 3-space. A depth order of K, if exists, is a linear order < of the objects in K such that if K; L 2 K and K lies vertically below L then K < L. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If K is a set of n triangles whose xy-projections are alìfat', then a dep...
متن کاملApproximating Majority Depth
We consider the problem of approximating the majority depth (Liu and Singh, 1993) of a point q with respect to an n-point set, S, by random sampling. At the heart of this problem is a data structures question: How can we preprocess a set of n lines so that we can quickly test whether a randomly selected vertex in the arrangement of these lines is above or below the median level. We describe a M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060669474